Fast convolutions meet Montgomery
نویسندگان
چکیده
منابع مشابه
Fast convolutions meet Montgomery
Arithmetic in large ring and field extensions is an important problem of symbolic computation, and it consists essentially of the combination of one multiplication and one division in the underlying ring. Methods are known for replacing one division by two short multiplications in the underlying ring, which can be performed essentially by using convolutions. However, while using school-book mul...
متن کاملFast Digital Convolutions using Bit-Shifts
An exact, one-to-one transform is presented that not only allows digital circular convolutions, but is free from multiplications and quantisation errors for transform lengths of arbitrary powers of two. The transform is analogous to the Discrete Fourier Transform, with the canonical harmonics replaced by a set of cyclic integers computed using only bit-shifts and additions modulo a prime number...
متن کاملFast Fitting of Convolutions Using Rational Approximations
Models of response time distributions are powerful models because they capture mean response times as well as variability and asymmetry. Some of these models are expressed with a closed-form equation (e.g. the Weibull distribution). However, a large number of others are not available in closed form, including convolutions. Fitting such distributions with the likelihood method is still possible ...
متن کاملFast nonparametric estimation for convolutions of densities
The present paper is concerned with the problem of estimating the convolution of densities. We propose an adaptive estimator based on kernel methods, Fourier analysis and the Lepski method. We study its L2-risk properties. Fast and new rates of convergence are determined for a wide class of unknown functions. Numerical illustrations, on both simulated and real data, are provided to assess the p...
متن کاملScalable VLSI Design for Fast GF(p) Montgomery Inverse Computation
This paper accelerates a scalable GF(p) Montgomery inversion hardware. The hardware is made of two parts a memory and a computing unit. We modified the original memory unit to include parallel shifting of all bits which was a task handled by the computing unit. The new hardware modeling, simulating, and synthesizing is performed through VHDL for several 160-bits designs showing interesting spee...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2007
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-07-01956-4